Sign-Preserving Min-Sum Decoders
نویسندگان
چکیده
This paper proposes a new finite precision iterative decoder for low-density parity-check (LDPC) codes. The proposed decoder, named Sign-Preserving Min-Sum (SP-MS), significantly improves the decoding performance compared to classical Offset (OMS) when messages are quantized on $q=2$ , 3, or 4 bits. particularity of SP-MS is that cannot take 0 value, and can fully benefit from notation="LaTeX">$q$ bits precision. optimization investigated in asymptotic limit code length using density evolution (DE). Our study shows 3-bit decoders achieve same error-correcting as 5-bit OMS decoders, 2-bit outperform decoders. finite-length simulations confirm conclusions DE analysis several LDPC signal-to-noise ratio (SNR) gain up 0.43 dB, with memory/wire reduction 40%, decoder. Moreover, converges faster uses fewer iterations than an improvement 83.3% average throughput. On FPGA, reduces resource utilization by 56%
منابع مشابه
Design, Simulation and Hardware implementation of Low Density Parity Check Decoders using Min-Sum Algorithm
A Variable Node Processing Unit (VNPU) and a Check Node Processing Unit (CNPU) are designed in order to be used in Low Density Parity Check (LDPC) decoding by the Min-Sum Algorithm (MSA). The designed blocks are fully parallel and flexible to be used for different block length when a regular (3, 6) LDPC codes are required. The proposed VNPU and CNPU have been first designed and implemented in s...
متن کاملMin, Max, and Sum
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...
متن کاملMin Sum Clustering with Penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects , called outliers, may exert a disproportionately strong influence over the solution. In this work we investigate the k-min-sum clustering problem while addressing outliers in a meaningful way. Given a complete graph G = (V,...
متن کاملBubble check: a simplified algorithm for elementary check node processing in extended min-sum non-binary LDPC decoders
متن کامل
Min-Sum-Min Message-Passing for Quadratic Optimization
We study the minimization of a quadratic objective function in a distributed fashion. It is known that the min-sum algorithm can be applied to solve the minimization problem if the algorithm converges. We propose a min-summin message-passing algorithm which includes the min-sum algorithm as a special case. As the name suggests, the new algorithm involves two minimizations in each iteration as c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2021
ISSN: ['1558-0857', '0090-6778']
DOI: https://doi.org/10.1109/tcomm.2021.3099173